Determining the L(2, 1)L(2, 1)-span in polynomial space

نویسندگان

  • Konstanty Junosza-Szaniawski
  • Jan Kratochvíl
  • Mathieu Liedloff
  • Pawel Rzazewski
چکیده

A k-L(2, 1)-labeling of a graph is a function from its vertex set into the set {0, . . . , k}, such that the labels assigned to adjacent vertices differ by at least 2, and labels assigned to vertices of distance 2 are different. It is known that finding the smallest k admitting the existence of a k-L(2, 1)labeling of any given graph is NP-Complete. In this paper we present an algorithm for this problem, which works in time O((9 + ǫ)n) and polynomial memory, where ǫ is an arbitrarily small positive constant. This is the first exact algorithm for L(2, 1)-labeling problem with time complexity O(cn) for some constant c and polynomial space complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any integer l > 1 and constant c < l, there exists a positive constant d such that QSATl cannot be computed by such machines in time n and space n, where QSATl denotes the problem of deciding the validity of a quantified Boolea...

متن کامل

The join of algebraic curves

Let P be the n-dimensional projective space over C. Denote by G(1,P) the grassmannian of the all projective lines in P. By the Plücker embedding G(1,P) →֒ P( n+1 2 )−1 the grassmannian is an algebraic subset of P( n+1 2 ). For any projective line L ⊂ P we will denote by [L] the corresponding point of G(1,P) and for any P,Q ∈ P, P 6= Q, we will denote by PQ the unique projective line in P spanned...

متن کامل

On irreducible no-hole L(2, 1)-coloring of trees

We consider a variant of the channel assignment problem in which frequencies are assigned to transmitters in a way that avoids interference while ensuring that all frequencies within the bandwidth are used. This is modeled as an L(2, 1)-coloring of a graph which is no-hole and irreducible in the sense that no color can be replaced with a smaller one. In this paper, we show that if the network i...

متن کامل

Space H of Kähler metrics in the class

1 Overview 1. This talk is about geodesics in the infinite dimensional symmetric space of Kähler metrics in a fixed Kähler classá la Donaldson-Semmes. 2. These geodesics are solutions of a homogeneous complex Monge-Ampère equation in 'space-time'. One would like to know existence, regularity... 3. Phong-Sturm proved that one can construct weak solutions by special polynomial approximations. The...

متن کامل

Bounds on Projections onto Bivariate Polynomial Spline Spaces with Stable Bases

We derive L 1 bounds for norms of projections onto bivariate polynomial spline spaces on regular triangulations with stable local bases. We then apply this result to derive error bounds for best L 2-and`2-approximation by splines on quasi-uniform triangulations. x1. Introduction Let X L 1 (() be a linear space deened a set with polygonal boundary. Suppose hh; i is a semi-deenite inner-product o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 161  شماره 

صفحات  -

تاریخ انتشار 2013